Bounded Intention Planning Revisited
نویسندگان
چکیده
Bounded Intention Planning (BIP) [7] is a pruning approach for optimal planning with unary operators. BIP has the flavor of partial order reduction, which has recently found increasing interest for optimal planning [4, 6]. However, although BIP is claimed to be a variant of stubborn sets [3] in the original paper, no proof is given for this claim. In this paper, we shed light on the relationship of BIP and stubborn sets. In particular, we show that BIP’s operator partitions sometimes correspond to strong stubborn sets defined for planning [5].
منابع مشابه
Bounded Intention Planning Revisited: Proof
s[v] = preo[v] s[w] = prvo[w] ∀w ∈ vars(prvo) s[Ov] = o s[Ow] = frozen ∀w ∈ vars(prvo) s[Cw] = v ∀w ∈ vars(prvo) We show that all operators o′ that interfere with Fire(o) are not applicable in s. Thus Fire(o) is the only applicable operator in Ts. Second, we show that for all these operators o′ ∈ Ts (except for Fire(o)), Ts already contains a necessary enabling set for o′ in s. Let u 6= Fire(o)...
متن کاملThe function ring functors of pointfree topology revisited
This paper establishes two new connections between the familiar function ring functor ${mathfrak R}$ on the category ${bf CRFrm}$ of completely regular frames and the category {bf CR}${mathbf sigma}${bf Frm} of completely regular $sigma$-frames as well as their counterparts for the analogous functor ${mathfrak Z}$ on the category {bf ODFrm} of 0-dimensional frames, given by the integer-valued f...
متن کاملTowards Practical Planning to Predict and Exploit Intentions for Interacting with Self-Interested Agents
A key challenge in non-cooperative multi-agent systems is that of developing effi-cient planning algorithms for intelligent agents to interact and perform effectivelyamong boundedly rational, self-interested agents (e.g., humans). The practicalityof existing works addressing this challenge is being undermined due to either therestrictive assumptions of the other agents’ behavior...
متن کاملInteractive POMDP Lite: Towards Practical Planning to Predict and Exploit Intentions for Interacting with Self-Interested Agents
A key challenge in non-cooperative multi-agent systems is that of developing efficient planning algorithms for intelligent agents to interact and perform effectively among boundedly rational, selfinterested agents (e.g., humans). The practicality of existing works addressing this challenge is being undermined due to either the restrictive assumptions of the other agents’ behavior, the failure i...
متن کاملDecision-Theoretic Deliberation in Resource Bounded Self-Aware Agents
In this paper we introduce the notion of decisiontheoretic deliberation, which studies the relation between classical game and decision theory on the one hand, and agent theories of deliberation on the other hand. We aim at modelling the commonsense notion of intention in systems which are self-aware of their bounded reasoning power concerning their decisions. We propose a transparent decision ...
متن کامل